Lloyd-Topor completion and general stable models

نویسندگان

  • Vladimir Lifschitz
  • Fangkai Yang
چکیده

We investigate the relationship between the generalization of program completion defined in 1984 by Lloyd and Topor and the generalization of the stable model semantics introduced recently by Ferraris et al.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representing Actions in Logic-based Languages

We investigate using logic programming, causal theories and action languages to describe effects of actions and reason about dynamic domains. This includes characterizing first-order causal theory by functional completion, characterizing first-order stable models by Lloyd-Topor completion, representing causal theories in logic programming and describing dynamic domains in the new action languag...

متن کامل

Nonmonotonic Reasoning for First - Order

The stable model semantics and the well-founded semantics are usually considered for programs with rules of the simple structure, which is a consequence of literals. We generalize these semantics for rst-order programs. We proof properties of these semantics, particular relations with minimal models and equivalent transformations. Besides, we investigate the possibilities of reducing rst-order ...

متن کامل

Integrity Checking in Deductive Data Bases

We describe the theory and implementation of a general theorem-proving technique for checking integrity of deductive databases recently proposed by Sadri and Kowalski. The method uses an extension of the SLDNF proof procedure and achieves the effect of the simplification algorithms of Nicolas, Lloyd, Topor et al, and Decker by reasoning forwards from the update and thus focusing on the relevant...

متن کامل

Range Restriction for General Formulas

Deductive databases need general formulas in rule bodies, not only conjuctions of literals. This is well known since the work of Lloyd and Topor about extended logic programming. Of course, formulas must be restricted in such a way that they can be effectively evaluated in finite time, and produce only a finite number of new tuples (in each iteration of the TP -operator: the fixpoint can still ...

متن کامل

A Reconstruction of the Lloyd-Topor Transformation

The Lloyd-Topor transformation is a classical transformation that translates extended logic programs with logical connectives and explicit quantifiers into normal logic programs. In this paper we show that this translation can be achieved in a natural way by specialising a meta-interpreter for extended logic programs. For this we use the logen partial evaluation system, extended to handle corou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • TPLP

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2013